Sciweavers

372 search results - page 74 / 75
» Using Syntactic Information for Improving Why-Question Answe...
Sort
View
CIKM
2010
Springer
13 years 4 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CCS
2010
ACM
13 years 6 months ago
Sidebuster: automated detection and quantification of side-channel leaks in web application development
A web application is a "two-part" program, with its components deployed both in the browser and in the web server. The communication between these two components inevita...
Kehuan Zhang, Zhou Li, Rui Wang 0010, XiaoFeng Wan...
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 5 months ago
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effe...
Youngwook Ko, Sergiy A. Vorobyov, Masoud Ardakani
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 5 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 9 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh