Sciweavers

2266 search results - page 253 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ECCV
2002
Springer
16 years 8 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
192
Voted
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 6 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
16 years 4 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
CSE
2009
IEEE
16 years 1 months ago
Analysis of Vehicular Roaming through Multiple WLAN APs in Container Terminal
—This paper reports on measurement results for the simultaneous use of multiple WLAN APs in a large area. We describe some problems of applying legacy IEEE 802.11 WLAN technologi...
Hyun-Sung Park, Seung-Ho Han, Jong-Deok Kim
COCOA
2009
Springer
16 years 1 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...