Sciweavers

776 search results - page 44 / 156
» Distributed Information Regularization on Graphs
Sort
View
SIGIR
2008
ACM
15 years 13 days ago
A large time-aware web graph
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
Paolo Boldi, Massimo Santini, Sebastiano Vigna
PPSN
2004
Springer
15 years 5 months ago
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
Gabriele Koller, Günther R. Raidl
88
Voted
IPPS
2000
IEEE
15 years 4 months ago
Buffered Coscheduling: A New Methodology for Multitasking Parallel Jobs on Distributed Systems
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
Fabrizio Petrini, Wu-chun Feng
IWIC
2007
Springer
15 years 6 months ago
Social Conventions and Issues of Space for Distributed Collaboration
We followed the work of an international research network that holds regular meetings in technology-enhanced environments. The team is geographically distributed and to support its...
Hillevi Sundholm
IPSN
2009
Springer
15 years 7 months ago
Predictive QoS routing to mobile sinks in wireless sensor networks
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
Branislav Kusy, HyungJune Lee, Martin Wicke, Nikol...