Sciweavers

451 search results - page 22 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
121
Voted
AML
2011
204views Mathematics» more  AML 2011»
14 years 4 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
COMPGEOM
2006
ACM
15 years 3 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
MDM
2009
Springer
125views Communications» more  MDM 2009»
15 years 4 months ago
Data Gathering by Mobile Mules in a Spatially Separated Wireless Sensor Network
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this...
Fang-Jing Wu, Chi-Fu Huang, Yu-Chee Tseng
68
Voted
ICCV
2007
IEEE
15 years 11 months ago
Limits of Learning-Based Superresolution Algorithms
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung T...
82
Voted
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 7 months ago
The asymmetric sinistral/dextral Markov-Dubins problem
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
Efstathios Bakolas, Panagiotis Tsiotras