Sciweavers

1176 search results - page 47 / 236
» Implicit Abstraction Heuristics
Sort
View
WWW
2008
ACM
14 years 10 months ago
Mining the search trails of surfing crowds: identifying relevant websites from user activity
The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users. While it has been previously shown that...
Mikhail Bilenko, Ryen W. White
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
14 years 10 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
ICTAC
2009
Springer
14 years 4 months ago
A Deadlock-Free Semantics for Shared Memory Concurrency
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
Gérard Boudol
IBPRIA
2003
Springer
14 years 3 months ago
Set-Permutation-Occurrence Matrix Based Texture Segmentation
Abstract. We have investigated a combination of statistical modelling and expectation maximisation for a texture based approach to the segmentation of mammographic images. Texture ...
Reyer Zwiggelaar, Lilian Blot, David Raba, Erika R...
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
14 years 2 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert