Sciweavers

2925 search results - page 61 / 585
» Information Complexity of Online Problems
Sort
View
AIPS
2008
15 years 8 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
IWPT
2001
15 years 7 months ago
Automatic Grammar Partitioning for Syntactic Parsing
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
Po-Chui Luk, Fuliang Weng, Helen Meng
CMPB
2010
141views more  CMPB 2010»
15 years 6 months ago
Real-time segmentation by Active Geometric Functions
Recent advances in 4D imaging and real-time imaging provide image data with clinically important cardiac dynamic information at high spatial or temporal resolution. However, the en...
Qi Duan, Elsa D. Angelini, Andrew F. Laine
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 7 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
CIB
2005
125views more  CIB 2005»
15 years 5 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka