Sciweavers

363 search results - page 71 / 73
» Validation coverage analysis for complex digital designs
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 7 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
CIKM
2010
Springer
13 years 6 months ago
CiteData: a new multi-faceted dataset for evaluating personalized search performance
Personalized search systems have evolved to utilize heterogeneous features including document hyperlinks, category labels in various taxonomies and social tags in addition to free...
Abhay Harpale, Yiming Yang, Siddharth Gopal, Daqin...
ACSC
2010
IEEE
13 years 2 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
CHI
2007
ACM
14 years 7 months ago
An observational study on information flow during nurses' shift change
We present an observational study that was conducted to guide the design and development of technologies to support information flow during nurses' shift change in a hospital...
Charlotte Tang, M. Sheelagh T. Carpendale
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah