Sciweavers

1941 search results - page 363 / 389
» On the Hardness of Approximate Reasoning
Sort
View
AIPS
2009
15 years 28 days ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
CONEXT
2009
ACM
15 years 27 days ago
MDCube: a high performance network structure for modular data center interconnection
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
Haitao Wu, Guohan Lu, Dan Li, Chuanxiong Guo, Yong...
HUC
2010
Springer
15 years 27 days ago
Groupthink: usability of secure group association for wireless devices
A fairly common modern setting entails users, each in possession of a personal wireless device, wanting to communicate securely, via their devices. If these users (and their devic...
Rishab Nithyanand, Nitesh Saxena, Gene Tsudik, Ers...
MM
2010
ACM
177views Multimedia» more  MM 2010»
15 years 3 hour ago
Image tag refinement towards low-rank, content-tag prior and error sparsity
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
Guangyu Zhu, Shuicheng Yan, Yi Ma
SIGCOMM
2010
ACM
15 years 50 min ago
Generic and automatic address configuration for data center networks
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
Kai Chen, Chuanxiong Guo, Haitao Wu, Jing Yuan, Zh...