Sciweavers

4134 search results - page 529 / 827
» Collaborative Practice Research
Sort
View
143
Voted
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 6 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
ESWS
2008
Springer
15 years 6 months ago
The Principle of Self-Description: Identity Through Linking
Abstract. If one wants to have a scheme for identifying non-Web accessible entities, should it be centralized or decentralized? Given a URI, how can one tell if it refers to a web ...
Harry Halpin
IQIS
2007
ACM
15 years 6 months ago
Towards a Benchmark for ETL Workflows
Extraction–Transform–Load (ETL) processes comprise complex data workflows, which are responsible for the maintenance of a Data Warehouse. Their practical importance is denoted...
Panos Vassiliadis, Anastasios Karagiannis, Vasilik...
AAAI
2010
15 years 6 months ago
A Temporal Proof System for General Game Playing
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
Michael Thielscher, Sebastian Voigt
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
15 years 6 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer