Sciweavers

2514 search results - page 492 / 503
» On the Computation of Approximations of Database Queries
Sort
View
IMCS
2007
144views more  IMCS 2007»
13 years 7 months ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova
IPSN
2010
Springer
14 years 2 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 2 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
14 years 2 months ago
Scalable Algorithms for Distribution Search
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
Yasuko Matsubara, Yasushi Sakurai, Masatoshi Yoshi...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 1 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim