Sciweavers

1080 search results - page 128 / 216
» The Complexity of Belief Update
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
WWW
2005
ACM
16 years 7 months ago
Composite event queries for reactivity on the web
Reactivity on the Web is an emerging issue. The capability to automatically react to events (such as updates to Web resources) is essential for both Web services and Semantic Web ...
François Bry, James Bailey, Paula-Lavinia P...
CHI
2008
ACM
16 years 6 months ago
A solution to interface evolution issues: the multi-layer interface
Updating an operational system is often complex and awkward. In this article, we will explain how the concept of multi-layer interface could facilitate the evolution of operationa...
Bruno Merlin, Christophe Hurter, Raïlane Benh...
CADE
2006
Springer
16 years 6 months ago
Dynamic Logic with Non-rigid Functions
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
Bernhard Beckert, André Platzer
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting