Sciweavers

3897 search results - page 132 / 780
» complexity 2010
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
COGSCI
2010
103views more  COGSCI 2010»
13 years 10 months ago
From Perceptual Categories to Concepts: What Develops?
People are remarkably smart: They use language, possess complex motor skills, make nontrivial inferences, develop and use scientific theories, make laws, and adapt to complex dyna...
Vladimir M. Sloutsky
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 7 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 10 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
ICCBR
2010
Springer
13 years 9 months ago
Experience-Based Critiquing: Reusing Critiquing Experiences to Improve Conversational Recommendation
Product recommendation systems are now a key part of many e-commerce services and have proven to be a successful way to help users navigate complex product spaces. In this paper, w...
Kevin McCarthy, Yasser Salem, Barry Smyth