Sciweavers

1740 search results - page 305 / 348
» Minimal structures for stories
Sort
View
COMGEO
2010
ACM
13 years 9 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
CGA
2008
13 years 9 months ago
Interactive Reconfiguration of Urban Layouts
The ability to create and edit a model of a large-scale city is necessary for a variety of applications such as web-based navigation (e.g., MapQuest, GoogleEarth), emergency respo...
Daniel G. Aliaga, Bedrich Benes, Carlos A. Vanegas...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 months ago
Quickest Change Detection of a Markov Process Across a Sensor Array
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
Vasanthan Raghavan, Venugopal V. Veeravalli
JMLR
2008
230views more  JMLR 2008»
13 years 9 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
DSS
2007
226views more  DSS 2007»
13 years 9 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri