Sciweavers

9176 search results - page 1659 / 1836
» algorithms 2010
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
15 years 7 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
16 years 6 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 6 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
WSDM
2010
ACM
265views Data Mining» more  WSDM 2010»
16 years 3 months ago
Data-oriented Content Query System: Searching for Data into Text on the Web
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
Kevin Chen-Chuan Chang, Mianwei Zhou, Tao Cheng
PLDI
2010
ACM
16 years 3 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
« Prev « First page 1659 / 1836 Last » Next »