Sciweavers

216 search results - page 28 / 44
» Edge Search Number of Cographs in Linear Time
Sort
View
WWW
2009
ACM
14 years 8 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
IR
2008
13 years 7 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
CP
2003
Springer
14 years 26 days ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
COMPGEOM
2010
ACM
14 years 21 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ICMCS
2008
IEEE
175views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Fast mode decision for adaptive prediction error coding
In [1], Adaptive Prediction Error Coding (APEC) in spatial and frequency domain is proposed and significantly improves the coding efficiency of video coders. However, this approac...
Cixun Zhang, Kemal Ugur, Moncef Gabbouj