Sciweavers

1686 search results - page 173 / 338
» Programs as polygraphs: computability and complexity
Sort
View
PVLDB
2011
14 years 10 months ago
Column-Oriented Storage Techniques for MapReduce
Users of MapReduce often run into performance problems when they scale up their workloads. Many of the problems they encounter can be overcome by applying techniques learned from ...
Avrilia Floratou, Jignesh M. Patel, Eugene J. Shek...
ICASSP
2011
IEEE
14 years 7 months ago
Fast estimation of the state of the power grid using synchronized phasor measurements
—Both the communication limitation and the measurement properties based algorithm become the bottleneck of enhancing the traditional power system state estimation speed. The avai...
Tao Yang, Anjan Bose
ICAC
2007
IEEE
15 years 10 months ago
Towards Autonomic Fault Recovery in System-S
System-S is a stream processing infrastructure which enables program fragments to be distributed and connected to form complex applications. There may be potentially tens of thous...
Gabriela Jacques-Silva, Jim Challenger, Lou Degena...
TALG
2010
86views more  TALG 2010»
15 years 2 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
IAT
2006
IEEE
15 years 9 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...