Sciweavers

1955 search results - page 379 / 391
» Can Computers Handle Adverbs
Sort
View
142
Voted
MSWIM
2004
ACM
15 years 9 months ago
Consistency challenges of service discovery in mobile ad hoc networks
Emerging “urban” ad hoc networks resulting from a large number of individual WLAN users challenge the way users could explore and interact with their physical surroundings. Ro...
Christian Frank, Holger Karl
151
Voted
PLDI
2004
ACM
15 years 9 months ago
Region inference for an object-oriented language
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
Wei-Ngan Chin, Florin Craciun, Shengchao Qin, Mart...
AGTIVE
2003
Springer
15 years 9 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
WILF
2009
Springer
196views Fuzzy Logic» more  WILF 2009»
15 years 8 months ago
Interactive Image Retrieval in a Fuzzy Framework
In this paper, an interactive image retrieval scheme using MPEG-7 visual descriptors is proposed. The performance of image retrieval systems is still limited due to semantic gap, w...
Malay Kumar Kundu, Minakshi Banerjee, Priyank Bagr...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 8 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...