3025 search results - page 374 / 605 » Computational geometry: a retrospective |
159
click to vote
KYOTODL
2000
15 years 8 months ago
2000
This paper describes applications of the optimized pattern discover),framework to text and Webmining. In particular; we introduce a class of simple combinatorialpatterns over phra...
160
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
166
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
182
Voted
DATAMINE
2008
15 years 7 months ago
2008
Rules are commonly used for classification because they are modular, intelligible and easy to learn. Existing work in classification rule learning assumes the goal is to produce ca...
163
Voted
DM
2008
15 years 7 months ago
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...