Sciweavers

2631 search results - page 7 / 527
» A Practical Method for the Sparse Resultant
Sort
View
COMAD
2009
13 years 8 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
MOC
2000
69views more  MOC 2000»
13 years 7 months ago
Uniform hp convergence results for the mortar finite element method
The mortar finite element is an example of a non-conforming method which can be used to decompose and re-compose a domain into subdomains without requiring compatibility between th...
Padmanabhan Seshaiyer, Manil Suri
PAMI
2006
145views more  PAMI 2006»
13 years 7 months ago
Reflectance Sharing: Predicting Appearance from a Sparse Set of Images of a Known Shape
Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of vi...
Todd Zickler, Ravi Ramamoorthi, Sebastian Enrique,...
AC
2007
Springer
13 years 7 months ago
Free/Open Source Software Development: Recent Research Results and Methods
The focus of this chapter is to review what is known about free and open source software development (FOSSD) work practices, development processes, project and community dynamics,...
Walt Scacchi