Sciweavers

3244 search results - page 361 / 649
» On convex complexity measures
Sort
View
ISM
2006
IEEE
209views Multimedia» more  ISM 2006»
16 years 21 days ago
Holistic Comparison of Text Images for Content-Based Retrieval
The accurate recognition of text that appears in images/videos using analytical character recognition methods is often very difficult, despite the fact that the text might be corr...
Julinda Gllavata, Ermir Qeli, Bernd Freisleben
LICS
2006
IEEE
16 years 21 days ago
Fixed-Parameter Hierarchies inside PSPACE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
Guoqiang Pan, Moshe Y. Vardi
PDP
2006
IEEE
16 years 21 days ago
An O(n) Distributed Deadlock Resolution Algorithm
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of prev...
Manuel Prieto, Jesús E. Villadangos, Federi...
TRIDENTCOM
2006
IEEE
16 years 21 days ago
QUETZAL: qualified ultra-wideband testbed for reduced data-rates and location
— This work presents an UWB testbed for reduced data rates with capabilities of measuring range and location. The transmitter uses Time Hopping spread spectrum codes to reduce th...
Antonio Mollfulleda, M. Nájar, P. Miskovsky...
190
Voted
AUTOID
2005
IEEE
16 years 9 days ago
Impedance Matching Concepts in RFID Transponder Design
In this paper, we analyze impedance matching concepts in passive radio frequency identification (RFID) transponders, which are powered by the incoming RF energy and consist of an...
K. V. S. Rao, Pavel V. Nikitin, Sander F. Lam