Home Profile Contact Us
Quick Link
Universitas Indonesia Perpustakaan Universitas Indonesia Fakultas Ilmu Komputer Universitas Indonesia Remote Library Universitas Indonesia
Library Automation and Digital Archive
LONTAR
Fakultas Ilmu Komputer
Universitas Indonesia

Pencarian Sederhana

Advanced Search
Home
/
Search for:
Your search for 12511 returns 428 document(s)
Randomized Algorithms: A Polynomial-Time Approximation Algorithm for the Permanent of A Ma...
Type: Indeks Artikel Jurnal
Find Similar Add to Favorite Open in New Tab
Nonsmooth nonnegative matrix factorization (nsNMF), page 403
Type: Indeks Artikel Jurnal
Find Similar Add to Favorite Open in New Tab
Document clustering using nonnegative matrix factorization, page 373
Type: Indeks Artikel Jurnal
Find Similar Add to Favorite Open in New Tab
On Datalog vs Polynomial Time (13-25)
Author: Foto Afrati Stavros S.Cosmadakis Mihalis Yannakakis; |
Call Number: SEM-350 | Type: Indeks Artikel prosiding/Sem
Find Similar Add to Favorite Open in New Tab
Pengelompokan dokumen bahasa indonesia dengan teknik reduksi dimensi nonnegative matrix fa...
Author: Suryanto Ang; |
Call Number: SK-0752 (Softcopy SK-234) Source code SK-211 | Type: Skripsi
Find Similar Add to Favorite Open in New Tab
Linearising Nonlinear Recursions in Polynomial Time (182-189)
Author: Yatin P. Saraiya; |
Call Number: SEM-379 | Type: Indeks Artikel prosiding/Sem
Find Similar Add to Favorite Open in New Tab
A Randomized linear-time algorithm for finding minimum spanning trees,hal 9-15
Author: Philip N.Klein; |
Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar Add to Favorite Open in New Tab
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (Extended ...
Author: Shay Halperin, Uri Zwick; |
Call Number: SEM-212 | Type: Indeks Artikel prosiding/Sem
Find Similar Add to Favorite Open in New Tab
Algorithm 805: computation and uses of the semidiscrete matrix decomposition
Type: Indeks Artikel Jurnal
Find Similar Add to Favorite Open in New Tab
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane,H...
Author: Naven Garg; |
Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar Add to Favorite Open in New Tab
Prev   1 2 3 4 5 6 7 8 9 10  Next
Latest Collection
Mega Frog Multi Agent Enhanced Generation and Adaptation Frramework of Open Graphrag
Type: Skripsi
Analisis Pengaruh Fear of Mising out dan Electronic Word of Mounth Terhadap Subscription Intention pada Layanan Subscription Video on Demend
Type: Skripsi
Analisis Faktor-Faktor yang Memengaruhi Switching Intention dari Tayangan Olahraga yang Disiarkan Secara Ilegal ke Tayangan Olahraga yang Disiarkan Secara Legal Berbasis Langganan Menggunakan Teori Push Pull Mooring (PPM) Pada Pengguna di Indonesia
Type: Skripsi
Analisis Faktor-Faktor Niat Penggunaan Layanan Kendaraan Elektrik pada Aplikasi Ride-Hailing
Type: Skripsi
Bencmarking Indonesian Math Problems with Large Language Models
Type: Skripsi
Analisis Faktor-Faktor yang Memengaruhi Penggunaan Sistem Manajemen Pengetahuan: Studi Kasus Direktorat Jenderal Pajak
Type: Skripsi
Analisis Faktor-Faktor Pengguna yang Memengaruhi Switching Intention dari Layanan Social Media Freemium ke Premium Berdasarkan Teori Push Pull Mooring
Type: Skripsi
Analisis Faktor yang Memengaruhi Continuance Learning Intention dengan Affordance Theory pada Fitur Gamifikasi di Aplikasi E-Learning Studi Kasus: Duolingo
Type: Skripsi
Analisis Faktor-Faktor yang Memengaruhi Switching Intention dari Search Engine ke Generator Kode Berbasis Artificial Intelligence dalam Software Engineering dengan Teori Push, Pull, dan Mooring
Type: Skripsi
SYCL vs CUDA vs HIP: Evaluating the Performance and Portability of Different GPU Programming Models on NVIDIA and AMD GPUs
Type: Skripsi
Favorite
Login
Advanced Search