Sciweavers

693 search results - page 84 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
13 years 8 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
PODC
2011
ACM
12 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 3 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Fast predictive variable-block-size motion estimation for H.264/AVC
The emerging H.264 advanced video coding (H.264/AVC) standard achieves significant improvement in coding efficiency compared with previous standards such as MPEG-2 and H.263. On...
Zhi Yang, Jiajun Bu, Chun Chen, Xu Li
EDBT
2011
ACM
225views Database» more  EDBT 2011»
12 years 11 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...