Sciweavers

5624 search results - page 73 / 1125
» On Conditional Covering Problem
Sort
View
MDAI
2009
Springer
16 years 22 days ago
Using Conditional Random Fields for Decision-Theoretic Planning
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
Paul A. Ardis, Christopher M. Brown
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 3 months ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar
FUIN
2010
141views more  FUIN 2010»
15 years 3 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 29 days ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ASPDAC
2009
ACM
130views Hardware» more  ASPDAC 2009»
16 years 21 days ago
Analog placement with common centroid and 1-D symmetry constraints
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
Linfu Xiao, Evangeline F. Y. Young