Sciweavers

363 search results - page 3 / 73
» Partial Multicuts in Trees
Sort
View
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
11 years 11 months ago
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 traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
JDCTA
2010
163views more  JDCTA 2010»
13 years 3 months ago
An Efficient Syntactic Analyzer Using Semantic Connection Units
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...
Yong-uk Park, Hyuk-chul Kwon
ICALP
2010
Springer
14 years 1 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
ICASSP
2010
IEEE
13 years 3 months ago
Physical layer algorithm and hardware verification of MIMO relays using cooperative partial detection
Cooperative communication with multi-antenna relays can significantly increase the reliability and speed. However, cooperative MIMO detection would impose considerable complexity o...
Kiarash Amiri, Michael Wu, Melissa Duarte, Joseph ...
SIAMCOMP
2000
99views more  SIAMCOMP 2000»
13 years 8 months ago
Squarish k-d Trees
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
Luc Devroye, Jean Jabbour, Carlos Zamora-Cura