Sciweavers

181 search results - page 7 / 37
» Binary Change Set Composition
Sort
View
IPSN
2007
Springer
14 years 1 months ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...
TSC
2010
133views more  TSC 2010»
13 years 6 months ago
Semantic-Based Mashup of Composite Applications
—The need for integration of all types of client and server applications that were not initially designed to interoperate is gaining popularity. One of the reasons for this popul...
Anne H. H. Ngu, Michael Pierre Carlson, Quan Z. Sh...
IJAC
2007
89views more  IJAC 2007»
13 years 7 months ago
Bounding Right-Arm Rotation Distances
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
Sean Cleary, Jennifer Taback
JILP
2000
165views more  JILP 2000»
13 years 7 months ago
BMAT - A Binary Matching Tool for Stale Profile Propagation
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
Zheng Wang, Ken Pierce, Scott McFarling
POPL
2005
ACM
14 years 7 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...