Sciweavers

2747 search results - page 516 / 550
» Non-oblivious Strategy Improvement
Sort
View
PVLDB
2010
103views more  PVLDB 2010»
14 years 8 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
14 years 8 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
SOSYM
2010
174views more  SOSYM 2010»
14 years 8 months ago
Automatic generation of basic behavior schemas from UML class diagrams
: The specification of a software system must include all relevant static and dynamic aspects of the domain. Dynamic aspects are usually specified by means of a behavioral schema c...
Manoli Albert, Jordi Cabot, Cristina Gómez,...
TKDE
2010
229views more  TKDE 2010»
14 years 8 months ago
Deriving Concept-Based User Profiles from Search Engine Logs
—User profiling is a fundamental component of any personalization applications. Most existing user profiling strategies are based on objects that users are interested in (i.e., p...
Kenneth Wai-Ting Leung, Dik Lun Lee
ACL
2010
14 years 8 months ago
Practical Very Large Scale CRFs
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
Thomas Lavergne, Olivier Cappé, Franç...