Sciweavers

209 search results - page 20 / 42
» Decomposable Constraints
Sort
View
SIGIR
2005
ACM
14 years 1 months ago
An exploration of axiomatic approaches to information retrieval
Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model’s empirica...
Hui Fang, ChengXiang Zhai
CPAIOR
2005
Springer
14 years 1 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
ICCAD
2000
IEEE
148views Hardware» more  ICCAD 2000»
13 years 12 months ago
FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders
—As the complexity of digital filters is dominated by the number of multiplications, many works have focused on minimizing the complexity of multiplier blocks that compute the co...
Hyeong-Ju Kang, Hansoo Kim, In-Cheol Park
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
CVPR
2011
IEEE
13 years 3 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff