Sciweavers

1709 search results - page 322 / 342
» Precise Modeling of Design Patterns
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 3 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
SASN
2003
ACM
14 years 2 months ago
Location-based pairwise key establishments for static sensor networks
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversar...
Donggang Liu, Peng Ning
COCOON
2003
Springer
14 years 2 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
ICADL
2003
Springer
140views Education» more  ICADL 2003»
14 years 2 months ago
LVS Digital Library Cluster with Fair Memory Utilization
A digital library system consists of LVS(Linux Virtual Server) operating with software clustering technology provides is designed on Linux environment. In the cluster of servers fa...
MinHwan Ok, Kyeongmo Kang, Myong-Soon Park