Sciweavers

5459 search results - page 1022 / 1092
» Context in Web Search
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 4 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
MIR
2006
ACM
157views Multimedia» more  MIR 2006»
14 years 3 months ago
Generating summaries and visualization for large collections of geo-referenced photographs
We describe a framework for automatically selecting a summary set of photos from a large collection of geo-referenced photographs. Such large collections are inherently difficult ...
Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Dav...
VISUALIZATION
2005
IEEE
14 years 3 months ago
Query-Driven Visualization of Large Data Sets
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
Kurt Stockinger, John Shalf, Kesheng Wu, E. Wes Be...
SG
2005
Springer
14 years 3 months ago
Multi-level Interaction in Parametric Design
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
Robert Aish, Robert Woodbury
DMKD
2004
ACM
139views Data Mining» more  DMKD 2004»
14 years 3 months ago
Iterative record linkage for cleaning and integration
Record linkage, the problem of determining when two records refer to the same entity, has applications for both data cleaning (deduplication) and for integrating data from multipl...
Indrajit Bhattacharya, Lise Getoor
« Prev « First page 1022 / 1092 Last » Next »