Sciweavers

2434 search results - page 391 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
138
Voted
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 3 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
134
Voted
EDBT
2006
ACM
136views Database» more  EDBT 2006»
16 years 3 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
CHI
2009
ACM
15 years 10 months ago
Matchin: eliciting user preferences with an online game
Eliciting user preferences for large datasets and creating rankings based on these preferences has many practical applications in community-based sites. This paper gives a new met...
Severin Hacker, Luis von Ahn
ICIP
2009
IEEE
15 years 10 months ago
A Novel Framework for Imaging Using Compressed Sensing
Recently, there has been growing interest in using compressed sensing to perform imaging. Most of these algorithms capture the image of a scene by taking projections of the imaged ...
Pradeep Sen and Soheil Darabi
119
Voted
HIPC
2007
Springer
15 years 9 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...