Sciweavers

5595 search results - page 998 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
15 years 4 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
TON
1998
145views more  TON 1998»
15 years 4 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
151
Voted
OL
2007
103views more  OL 2007»
15 years 4 months ago
Support vector machine via nonlinear rescaling method
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [9, 11, 10] and references therein). The formulation of t...
Roman A. Polyak, Shen-Shyang Ho, Igor Griva
JAIR
2010
145views more  JAIR 2010»
15 years 3 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
222
Voted
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 8 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik