Sciweavers

3359 search results - page 406 / 672
» A Simplified Idea Algorithm
Sort
View
115
Voted
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
15 years 5 months ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
DIS
2001
Springer
15 years 5 months ago
Eliminating Useless Parts in Semi-structured Documents Using Alternation Counts
We propose a preprocessing method for Web mining which, given semi-structured documents with the same structure and style, distinguishes useless parts and non-useless parts in each...
Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa
119
Voted
INFOCOM
2000
IEEE
15 years 5 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
SCALESPACE
1999
Springer
15 years 4 months ago
Region Tracking on Surfaces Deforming via Level-Sets Methods
Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In...
Marcelo Bertalmío, Guillermo Sapiro, Gregor...
AI
1998
Springer
15 years 4 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels