Sciweavers

1056 search results - page 183 / 212
» Constraint-Based Graph Matching
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 9 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
WISE
2009
Springer
14 years 6 months ago
Entry Pairing in Inverted File
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
Hoang Thanh Lam, Raffaele Perego, Nguyen Thoi Minh...
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Multi-Scale Geometry Interpolation
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is ro...
Tim Winkler, J. Drieseberg, Marc Alexa, Kai Horman...
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
14 years 6 months ago
Applying Resource Sharing Algorithms to ADL-driven Automatic ASIP Implementation
Presently, Architecture Description Languages (ADLs) are widely used to raise the abstraction level of the design space exploration of Application Specific Instruction-set Proces...
Ernst Martin Witte, Anupam Chattopadhyay, Oliver S...
CBMS
2009
IEEE
14 years 3 months ago
Scenario-oriented information extraction from electronic health records
Providing a comprehensive set of relevant information at the point of care is crucial for making correct clinical decisions in a timely manner. Retrieval of scenario specific inf...
Anis Yousefi, Negin Mastouri, Kamran Sartipi