Sciweavers

3946 search results - page 567 / 790
» The computational complexity of choice sets
Sort
View
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
15 years 4 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti
CAD
2011
Springer
14 years 10 months ago
Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces
Ridges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualizati...
Suraj Musuvathy, Elaine Cohen, James N. Damon, Joo...
FOCS
2008
IEEE
15 years 6 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
CVPR
2011
IEEE
15 years 2 months ago
Supervised Local Subspace Learning for Continuous Head Pose Estimation
Head pose estimation from images has recently attracted much attention in computer vision due to its diverse applications in face recognition, driver monitoring and human computer...
Dong Huang, Markus Storer, Fernando DelaTorre, Hor...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 24 days ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie