Sciweavers

1963 search results - page 260 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
IEEEAMS
2003
IEEE
14 years 2 months ago
Communication Pattern Based Node Selection for Shared Networks
Selection of the most suitable nodes on a network to execute a parallel application requires matching the network status to the application requirements. We propose and validate a...
Srikanth Goteti, Jaspal Subhlok
VEE
2012
ACM
239views Virtualization» more  VEE 2012»
12 years 4 months ago
Transparent dynamic instrumentation
Process virtualization provides a virtual execution environment within which an unmodified application can be monitored and controlled while it executes. The provided layer of co...
Derek Bruening, Qin Zhao, Saman P. Amarasinghe
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CN
2002
77views more  CN 2002»
13 years 8 months ago
Architecture of a Web server accelerator
We describe the design, implementation and performance of a high-performance Web server accelerator which runs on an embedded operating system and improves Web server performance ...
Junehwa Song, Arun Iyengar, Eric Levy-Abegnoli, Da...
STACS
2009
Springer
14 years 3 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...