Sciweavers

2600 search results - page 234 / 520
» Clustering with or without the Approximation
Sort
View
LREC
2010
157views Education» more  LREC 2010»
15 years 8 months ago
Indexing Methods for Faster and More Effective Person Name Search
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
Mark Arehart
UAI
2008
15 years 8 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
CVPR
2004
IEEE
16 years 8 months ago
Names and Faces in the News
We show quite good face clustering is possible for a dataset of inaccurately and ambiguously labelled face images. Our dataset is 44,773 face images, obtained by applying a face f...
Tamara L. Berg, Alexander C. Berg, Jaety Edwards, ...
IPPS
2008
IEEE
16 years 1 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
TPDS
2008
91views more  TPDS 2008»
15 years 6 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...