Sciweavers

1511 search results - page 281 / 303
» Randomness, lowness and degrees
Sort
View
CGF
2011
14 years 3 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
15 years 5 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
OSDI
2004
ACM
16 years 2 days ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...
ISI
2008
Springer
14 years 11 months ago
Real time intrusion prediction, detection and prevention programs
An Intrusion Detection Program (IDP) analyzes what happens or has happened during an execution and tries to find indications that the computer has been misused. In this talk, we p...
A. Abraham
BMCBI
2005
113views more  BMCBI 2005»
14 years 11 months ago
Microarray scanner calibration curves: characteristics and implications
Background: Microarray-based measurement of mRNA abundance assumes a linear relationship between the fluorescence intensity and the dye concentration. In reality, however, the cal...
Leming M. Shi, Weida Tong, Zhenqiang Su, Tao Han, ...