Sciweavers

5946 search results - page 1083 / 1190
» Visual requirement representation
Sort
View
ICSE
2004
IEEE-ACM
16 years 4 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
ICSE
2007
IEEE-ACM
16 years 4 months ago
Collaboration in Software Engineering: A Roadmap
Software engineering projects are inherently cooperative, requiring many software engineers to coordinate their efforts to produce a large software system. Integral to this effort...
Jim Whitehead
ICFP
2006
ACM
16 years 4 months ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
EUROSYS
2006
ACM
16 years 1 months ago
Ferret: a toolkit for content-based similarity search of feature-rich data
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
Qin Lv, William Josephson, Zhe Wang, Moses Charika...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 11 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
« Prev « First page 1083 / 1190 Last » Next »