4865 search results - page 639 / 973 » The Complexity of Graph Connectivity |
155
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
143
click to vote
COMPLEX
2009
Springer
16 years 23 days ago
2009
Springer
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
164
click to vote
CSL
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
176
click to vote
QSHINE
2005
IEEE
15 years 11 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
150
click to vote
SEMWEB
2005
Springer
15 years 11 months ago
2005
Springer
Recommender algorithms have been quite successfully employed in a variety of scenarios from filtering applications to recommendations of movies and books at Amazon.com. However, a...