Sciweavers

1272 search results - page 147 / 255
» Approximate Parameterized Matching
Sort
View
160
Voted
JDCTA
2010
152views more  JDCTA 2010»
14 years 10 months ago
A Semantic Approach to Extract the Final Answer in SBUQA Question Answering System
In this paper we introduce the semantic approach of the answer extraction component of a question answering system called SBUQA. The answer extraction component gets the retrieved...
Mehrnoush Shamsfard, Mahsa Arab Yarmohammadi
INFOCOM
2008
IEEE
15 years 10 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
130
Voted
FOCS
2004
IEEE
15 years 7 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
ICIP
2006
IEEE
16 years 5 months ago
The Snakuscule
Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the dat...
Michael Unser, Philippe Thévenaz
98
Voted
ICIP
2005
IEEE
16 years 5 months ago
Explicit contour model for vehicle tracking with automatic hypothesis validation
This paper addresses the problem of vehicle tracking under a single static, uncalibrated camera without any constraints on the scene or on the motion direction of vehicles. We int...
Boris Wai-Sing Yiu, Kwan-Yee Kenneth Wong, Francis...