Sciweavers

1391 search results - page 153 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ICPP
2008
IEEE
14 years 2 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...
ICCV
2007
IEEE
14 years 2 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
IPPS
2007
IEEE
14 years 2 months ago
Speculative Flow Control for High-Radix Datacenter Interconnect Routers
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
Cyriel Minkenberg, Mitchell Gusat
PG
2007
IEEE
14 years 2 months ago
Wrestle Alone : Creating Tangled Motions of Multiple Avatars from Individually Captured Motions
Animations of two avatars tangled with each other often appear in battle or fighting scenes in movies or games. However, creating such scenes is difficult due to the limitations...
Edmond S. L. Ho, Taku Komura
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
14 years 1 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel