SOFSEM 2007 - PDF Preprint Papers

SOFSEM 2007 Seminar/Conference on Current Trends in Theory and Practice of Informatics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SOFSEM-2007 Paper

click to vote

SOFSEM
2007
Springer

208views Theoretical Computer Science» more SOFSEM 2007»

Fast Approximate Point Set Matching for Information Retrieval

14 years 6 months ago

Download www.cs.bris.ac.uk

We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...

Raphaël Clifford, Benjamin Sach

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	208	Fast Approximate Point Set Matching for Information Retrieval	claim
2	161	Competitive Contract Net Protocol	claim
3	156	Creating Permanent Test Collections of Web Pages for Information Extraction Research	claim
4	155	Exact Max 2-Sat: Easier and Faster	claim
5	152	Building an Ontological Base for Experimental Evaluation of Semantic Web Applications	claim
6	151	Personalized Presentation in Web-Based Information Systems	claim
7	148	Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems	claim
8	143	Automatic Testing of Object-Oriented Software	claim
9	142	Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks	claim
10	135	Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces	claim
11	132	Incremental Learning of Planning Operators in Stochastic Domains	claim
12	128	Games, Time, and Probability: Graph Models for System Design and Analysis	claim
13	127	A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems	claim
14	123	A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks	claim
15	122	Improved Processing of Textual Use Cases: Deriving Behavior Specifications	claim
16	121	Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs	claim
17	121	A Simple Algorithm for Stable Minimum Storage Merging	claim
18	118	Deterministic Simulation of a NFA with k -Symbol Lookahead	claim
19	118	Constraints for Argument Filterings	claim
20	114	On Optimal Solutions for the Bottleneck Tower of Hanoi Problem	claim
21	113	On Efficient Resource Allocation in Communication Networks	claim
22	104	Straightening Drawings of Clustered Hierarchical Graphs	claim
23	103	Indexing Factors with Gaps	claim
24	101	About the Termination Detection in the Asynchronous Message Passing Model	claim
25	101	Restarting Tree Automata	claim
26	100	Partial vs. Complete Domination: t-Dominating Set	claim
27	99	Pattern Matching Algorithms with Don't Cares	claim
28	93	Model-Checking Large Finite-State Systems and Beyond	claim
29	91	Multimedia Retrieval Algorithmics	claim
30	89	Separation of Concerns and Consistent Integration in Requirements Modelling	claim
31	84	Maximum Finding in the Symmetric Radio Networks with Collision Detection	claim
32	83	A Short Introduction to Computational Social Choice	claim
33	83	Point-to-Point Shortest Path Algorithms with Preprocessing	claim
34	79	Interaction and Realizability	claim
35	62	Rapid Development of Web Interfaces to Heterogeneous Systems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers