Sciweavers

1688 search results - page 135 / 338
» The Complexity of Rationalizing Matchings
Sort
View
JACM
2000
119views more  JACM 2000»
15 years 5 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
MICS
2010
123views more  MICS 2010»
15 years 4 months ago
On the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
ICEGOV
2009
ACM
15 years 3 months ago
Design of a web-based tendering system for e-government procurement
Procurement for e-Government is an important part of activities which are similar to the nature of B2B. That is usually characterized by bulk volumes with complex variables, burea...
Simon Fong, Zhuang Yan
PERCOM
2011
ACM
14 years 9 months ago
Market mechanisms for Value of Information driven resource allocation in Sensor Networks
—This paper examines the possible uses of different market mechanisms for resource allocation at different levels of Wireless Sensor Network (WSN) architecture. The goal is to ma...
Boleslaw K. Szymanski, S. Yousaf Shah, Sahin Cem G...
SIAMREV
2011
63views more  SIAMREV 2011»
14 years 8 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying