Sciweavers

2244 search results - page 350 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
SIGIR
2004
ACM
15 years 11 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
VLDB
2004
ACM
101views Database» more  VLDB 2004»
15 years 11 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
ATMOS
2007
163views Optimization» more  ATMOS 2007»
15 years 7 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
16 years 19 days ago
OOPS for Motion Planning: An Online, Open-source, Programming System
— The success of sampling-based motion planners has resulted in a plethora of methods for improving planning components, such as sampling and connection strategies, local planner...
Erion Plaku, Kostas E. Bekris, Lydia E. Kavraki
CVPR
2008
IEEE
16 years 8 months ago
Graph-shifts: Natural image labeling by dynamic hierarchical computing
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
Jason J. Corso, Alan L. Yuille, Zhuowen Tu