Sciweavers

161 search results - page 32 / 33
» Counting Distinct Strings
Sort
View
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 7 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 7 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
VLDB
2002
ACM
137views Database» more  VLDB 2002»
13 years 7 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
PAMI
2007
245views more  PAMI 2007»
13 years 7 months ago
Tracking People by Learning Their Appearance
—An open vision problem is to automatically track the articulations of people from a video sequence. This problem is difficult because one needs to determine both the number of p...
Deva Ramanan, David A. Forsyth, Andrew Zisserman
PPOPP
2010
ACM
13 years 5 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...