Sciweavers

16188 search results - page 2576 / 3238
» The Optimal PAC Algorithm
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 7 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
16 years 7 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
MOBIHOC
2002
ACM
16 years 6 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
16 years 4 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
16 years 2 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
« Prev « First page 2576 / 3238 Last » Next »