Sciweavers

11808 search results - page 47 / 2362
» Isometries and Computability Structures
Sort
View
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
14 years 16 days ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
11 years 11 months ago
On the separability of structural classes of communities
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
COMPUTING
2007
99views more  COMPUTING 2007»
13 years 9 months ago
Surfaces with polar structure
Kestutis Karciauskas, Jörg Peters
FPL
2006
Springer
94views Hardware» more  FPL 2006»
14 years 19 days ago
Sizing of Processing Arrays for FPGA-Based Computation
Computing applications in FPGAs are commonly built from repetitive structures of computing and/or memory elements. In many cases, application performance depends on the degree of ...
Tom Van Court, Martin C. Herbordt
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai