Sciweavers

1095 search results - page 206 / 219
» Preprocessing of Intractable Problems
Sort
View
SIGIR
2003
ACM
14 years 28 days ago
Domain-independent text segmentation using anisotropic diffusion and dynamic programming
This paper presents a novel domain-independent text segmentation method, which identifies the boundaries of topic changes in long text documents and/or text streams. The method c...
Xiang Ji, Hongyuan Zha
VISUALIZATION
1997
IEEE
13 years 12 months ago
ROAMing terrain: real-time optimally adapting meshes
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...
Mark A. Duchaineau, Murray Wolinsky, David E. Sige...
CP
2006
Springer
13 years 11 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
BIOCOMP
2008
13 years 9 months ago
Reverse Engineering Module Networks by PSO-RNN Hybrid Modeling
Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reas...
Yuji Zhang, Jianhua Xuan, Benildo de los Reyes, Ro...