Sciweavers

13841 search results - page 2539 / 2769
» Algorithms and Constraint Programming
Sort
View
137
Voted
VISUALIZATION
1997
IEEE
15 years 8 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 7 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
HYBRID
2000
Springer
15 years 7 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...
EVOW
2010
Springer
15 years 7 months ago
Towards Automated Learning of Object Detectors
Recognizing arbitrary objects in images or video sequences is a difficult task for a computer vision system. We work towards automated learning of object detectors from video seque...
Marc Ebner
143
Voted
FLAIRS
2008
15 years 6 months ago
Building Useful Models from Imbalanced Data with Sampling and Boosting
Building useful classification models can be a challenging endeavor, especially when training data is imbalanced. Class imbalance presents a problem when traditional classificatio...
Chris Seiffert, Taghi M. Khoshgoftaar, Jason Van H...
« Prev « First page 2539 / 2769 Last » Next »