Sciweavers

6366 search results - page 1098 / 1274
» Statistical Performance Modeling and Optimization
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
INFOCOM
2003
IEEE
16 years 9 days ago
Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
Seung-Taek Park, Alexy Khrabrov, David M. Pennock,...
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
15 years 11 months ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
204
Voted
ICCV
2007
IEEE
16 years 9 months ago
Learning 3-D Scene Structure from a Single Still Image
We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitative...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
330
Voted
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
16 years 8 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
« Prev « First page 1098 / 1274 Last » Next »