Sciweavers

3341 search results - page 355 / 669
» On Bounded Queries and Approximation
Sort
View
HPDC
2003
IEEE
16 years 18 hour ago
Flexible Information Discovery in Decentralized Distributed Systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
Cristina Schmidt, Manish Parashar
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 12 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
15 years 11 months ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
CSMR
2000
IEEE
15 years 11 months ago
Architectural Design Recovery using Data Mining Techniques
This paper presents a technique for recovering the high level design of legacy software systems according to user defined architectural plans. Architectural plans are represented...
Kamran Sartipi, Kostas Kontogiannis, Farhad Mavadd...
APN
2010
Springer
15 years 4 months ago
Learning Workflow Petri Nets
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
Javier Esparza, Martin Leucker, Maximilian Schlund