Sciweavers

7006 search results - page 1278 / 1402
» Approximation Algorithms
Sort
View
RC
2000
99views more  RC 2000»
15 years 28 days ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
IJIG
2002
189views more  IJIG 2002»
15 years 25 days ago
Motion Detection from Time-Varied Background
This paper proposes a new background subtraction method for detecting moving objects from a time-varied background. While background subtraction has traditionally worked well for ...
Ying Ren, Chin-Seng Chua, Yeong-Khing Ho
JAIR
1998
198views more  JAIR 1998»
15 years 25 days ago
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
Alberto Ruiz, Pedro E. López-de-Teruel, M. ...
TIT
1998
69views more  TIT 1998»
15 years 24 days ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
TC
2002
15 years 24 days ago
General Modeling and Performance Analysis for Location Management in Wireless Mobile Networks
Location management plays a significant role in current and future wireless mobile networks in effectively delivering services to the mobile users on the move. Many schemes have be...
Yuguang Fang
« Prev « First page 1278 / 1402 Last » Next »