Sciweavers

3008 search results - page 395 / 602
» Independence in connected graphs
Sort
View
DATESO
2009
269views Database» more  DATESO 2009»
15 years 4 months ago
The BPM to UML activity diagram transformation using XSLT
The Business Process Model represented as a diagram in Business Process Modeling Notation (BPMN) is a commonly used way how to describe business processes of an organization. Probl...
Ondrej Macek, Karel Richta
ECCV
2008
Springer
16 years 8 months ago
Sparse Long-Range Random Field and Its Application to Image Denoising
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
Yunpeng Li, Daniel P. Huttenlocher
WWW
2005
ACM
16 years 7 months ago
On the lack of typical behavior in the global Web traffic network
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...
Mark Meiss, Filippo Menczer, Alessandro Vespignani
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 7 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
INFOCOM
2005
IEEE
16 years 14 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...