Sciweavers

762 search results - page 150 / 153
» A study of the uniqueness of source code
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 6 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
INFOCOM
2007
IEEE
14 years 2 days ago
Routing with a Markovian Metric to Promote Local Mixing
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Yunnan Wu, Saumitra M. Das, Ranveer Chandra
AOSD
2006
ACM
13 years 11 months ago
Presenting crosscutting structure with active models
When modifying or debugging a software system, among other tasks, developers must often understand and manipulate source code that crosscuts the system’s structure. These tasks ...
Wesley Coelho, Gail C. Murphy
INFOCOM
2005
IEEE
13 years 11 months ago
Improved single-round protocols for remote file synchronization
— Given two versions of a file, a current version located on one machine and an outdated version known only to another machine, the remote file synchronization problem is how t...
Utku Irmak, Svilen Mihaylov, Torsten Suel
INFOCOM
2005
IEEE
13 years 11 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik