Sciweavers

1419 search results - page 118 / 284
» group 2010
Sort
View
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
15 years 7 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
AAAI
2010
15 years 7 months ago
Assisting Users with Clustering Tasks by Combining Metric Learning and Classification
Interactive clustering refers to situations in which a human labeler is willing to assist a learning algorithm in automatically clustering items. We present a related but somewhat...
Sumit Basu, Danyel Fisher, Steven M. Drucker, Hao ...
NSDI
2010
15 years 7 months ago
Prophecy: Using History for High-Throughput Fault Tolerance
Byzantine fault-tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. We eliminate this cost for read-mostly ...
Siddhartha Sen, Wyatt Lloyd, Michael J. Freedman
CEC
2010
IEEE
15 years 7 months ago
A modified genetic algorithm for matching building sets with the histograms of forces
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
Andrew R. Buck, James M. Keller, Marjorie Skubic
CLEF
2010
Springer
15 years 7 months ago
WePS-3 Evaluation Campaign: Overview of the Web People Search Clustering and Attribute Extraction Tasks
The third WePS (Web People Search) Evaluation campaign took place in 2009-2010 and attracted the participation of 13 research groups from Europe, Asia and North America. Given the ...
Javier Artiles, Andrew Borthwick, Julio Gonzalo, S...