Sciweavers

3820 search results - page 135 / 764
» Bounded Model Debugging
Sort
View
PAMI
1998
100views more  PAMI 1998»
15 years 2 months ago
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
Ulf Grenander, Michael I. Miller, Anuj Srivastava
149
Voted
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 11 hour ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
159
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
206
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 3 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
94
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant