Sciweavers

9631 search results - page 1659 / 1927
» The Costs of Using JXTA
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 10 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
MICAI
2000
Springer
15 years 10 months ago
Eigenfaces Versus Eigeneyes: First Steps Toward Performance Assessment of Representations for Face Recognition
The Principal Components Analysis (PCA) is one of the most successfull techniques that have been used to recognize faces in images. This technique consists of extracting the eigenv...
Teófilo Emídio de Campos, Rogé...
NLP
2000
15 years 10 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
CNSR
2010
IEEE
164views Communications» more  CNSR 2010»
15 years 10 months ago
Buffered Crossbar Fabrics Based on Networks on Chip
— Buffered crossbar (CICQ) switches have shown a high potential in scaling Internet routers capacity. However, they require expensive on-chip buffers whose cost grows quadratical...
Lotfi Mhamdi, Kees Goossens, Iria Varela Senin
AOSD
2009
ACM
15 years 9 months ago
Modular verification of dynamically adaptive systems
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
Ji Zhang, Heather Goldsby, Betty H. C. Cheng
« Prev « First page 1659 / 1927 Last » Next »