Sciweavers

8496 search results - page 137 / 1700
» Problem Solving and Complex Systems
Sort
View
ICALP
2010
Springer
14 years 2 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen
CJ
2010
132views more  CJ 2010»
13 years 6 months ago
Internet Failures: an Emergent Sea of Complex Systems and Critical Design Errors?
Complex systems researchers have looked to the Internet as a possible source of interesting emergent behaviour. Indeed, some high profile failures, and some low level phenomena, m...
Jon Crowcroft
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 9 months ago
Events on the edge
The emergence of large-scale receptor-based systems has enabled applications to execute complex business logic over data generated from monitoring the physical world. An important...
Shariq Rizvi, Shawn R. Jeffery, Sailesh Krishnamur...
ICPR
2008
IEEE
14 years 3 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 2 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur