Sciweavers

8671 search results - page 1562 / 1735
» A generator for hierarchical problems
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 3 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
WWW
2009
ACM
14 years 3 months ago
News article extraction with template-independent wrapper
We consider the problem of template-independent news extraction. The state-of-the-art news extraction method is based on template-level wrapper induction, which has two serious li...
Junfeng Wang, Xiaofei He, Can Wang, Jian Pei, Jiaj...
ICST
2009
IEEE
14 years 3 months ago
Optimizing Probabilities of Real-Time Test Case Execution
—Model-based test derivation for real-time system has been proven to be a hard problem for exhaustive test suites. Therefore, techniques for real-time testing do not aim to exhau...
Nicolás Wolovick, Pedro R. D'Argenio, Hongy...
LAWEB
2009
IEEE
14 years 3 months ago
Promoting Creative Design through Toolkits
—Computer science academics and professionals typically consider their contributions in terms of the algorithms, applications, and techniques that they develop. Yet equally impor...
Saul Greenberg
ASIACRYPT
2009
Springer
14 years 3 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
« Prev « First page 1562 / 1735 Last » Next »