Sciweavers

1322 search results - page 120 / 265
» Parameterized counting problems
Sort
View
UIST
1995
ACM
14 years 1 months ago
Visual Interfaces for Solids Modeling
This paper exploresthe useof visualoperatorsfor solidsmodeling. We focus on designing interfaces for free-form operators such as blends, sweeps, and deformations, because these op...
Cindy Grimm, David Pugmire
COMPGEOM
2005
ACM
14 years 21 hour ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
ANOR
2005
102views more  ANOR 2005»
13 years 10 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
TIT
2008
83views more  TIT 2008»
13 years 10 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 4 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...