Sciweavers

858 search results - page 130 / 172
» One Is Enough!
Sort
View
GLOBECOM
2009
IEEE
14 years 3 months ago
Adaptive Dynamic Routing Supporting Service Management for Future Internet
— There is currently much debate in defining what form the Future Internet will take [22, 23, 24]. The current Internet is struggling to meet the needs of an ever-evolving societ...
Sasitharan Balasubramaniam, Dmitri Botvich, Ray Ca...
FOCS
2004
IEEE
14 years 18 days ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
DSN
2006
IEEE
14 years 17 days ago
Efficiently Detecting All Dangling Pointer Uses in Production Servers
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...
Dinakar Dhurjati, Vikram S. Adve
ISMB
1994
13 years 10 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 3 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...