338 search results - page 47 / 68 » Approximation Spaces and Information Granulation |
85
Voted
SEBD
2004
14 years 10 months ago
2004
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...
72
Voted
UAI
2003
14 years 10 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
JAIR
2006
14 years 9 months ago
2006
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
SODA
2007
ACM
14 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...