Sciweavers

2031 search results - page 328 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
CIKM
2009
Springer
14 years 4 months ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
CIKM
2009
Springer
14 years 4 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 4 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
FM
2009
Springer
123views Formal Methods» more  FM 2009»
14 years 4 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
ISEUD
2009
Springer
14 years 4 months ago
Fast, Accurate Creation of Data Validation Formats by End-User Developers
Abstract. Inputs to web forms often contain typos or other errors. However, existing web form design tools require end-user developers to write regular expressions (“regexps”) ...
Christopher Scaffidi, Brad A. Myers, Mary Shaw