Sciweavers

20294 search results - page 3871 / 4059
» Algorithmic Information Theory
Sort
View
CIKM
2004
Springer
15 years 12 months ago
Organizing structured web sources by query schemas: a clustering approach
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
EMSOFT
2004
Springer
15 years 12 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
15 years 12 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
ICCAD
2003
IEEE
99views Hardware» more  ICCAD 2003»
15 years 11 months ago
A Probabilistic Approach to Buffer Insertion
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati,...
ICDAR
2003
IEEE
15 years 11 months ago
Evaluating SEE - A Benchmarking System for Document Page Segmentation
The decomposition of a document into segments such as text regions and graphics is a significant part of the document analysis process. The basic requirement for rating and impro...
Stefan Agne, Andreas Dengel, Bertin Klein
« Prev « First page 3871 / 4059 Last » Next »