Sciweavers

556 search results - page 106 / 112
» Pair Programming: Not for Everyone
Sort
View
INFOCOM
2002
IEEE
14 years 19 days ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
INFOCOM
2002
IEEE
14 years 19 days ago
Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
Chunming Qiao, Dahai Xu
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
14 years 16 days ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
VLDB
2001
ACM
148views Database» more  VLDB 2001»
14 years 4 days ago
Indexing and Querying XML Data for Regular Path Expressions
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...
Quanzhong Li, Bongki Moon
ISD
1999
Springer
149views Database» more  ISD 1999»
13 years 12 months ago
Cost-Effective Determination of Biomass from Aerial Images
This paper describes an ongoing collaborative research program between the Computer Science and the Forestry and Wildlife Management Departments at the University of Massachusetts...
Howard J. Schultz, Dana Slaymaker, Chris Holmes, F...